Illumination Influence Minimization Method for Efficient Object

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient illumination normalization method for face recognition

In this paper, an efficient representation method insensitive to varying illumination is proposed for human face recognition. Theoretical analysis based on the human face model and the illumination model shows that the effects of varying lighting on a human face image can be modeled by a sequence of multiplicative and additive noises. Instead of computing these noises, which is very difficult f...

متن کامل

Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in [8] a theoretical framework that allows an optimal optimization of periodic storage requirement in a periodic schedule. This problem is used to optim...

متن کامل

Quantum path minimization: An efficient method for global optimization

A new unbiased global optimization approach is proposed, based on quantum staging path integral Monte Carlo sampling and local minimization of individual imaginary time slices. This algorithm uses the quantum tunneling effect to speed up the crossing of energy barriers. This method differs in important ways from previous work on quantum annealing and is able to find all the global minima of Len...

متن کامل

Efficient Minimization Method for Incompletely Defined Boolean Functions

The paper presents a minimization algorithm for Boolean functions whose values are defined only for a small part of their range. In contrast to other known minimization algorithms, it uses the "start big" strategy gradually reducing the dimensionality of a term until an implicant is generated. This approach leads to a very fast solution even for problems with several hundreds of input variables...

متن کامل

Parallel Coordinate Descent Newton Method for Efficient $\ell_1$-Regularized Minimization

The recent years have witnessed advances in parallel algorithms for large scale optimization problems. Notwithstanding demonstrated success, existing algorithms that parallelize over features are usually limited by divergence issues under high parallelism or require data preprocessing to alleviate these problems. In this work, we propose a Parallel Coordinate Descent Newton algorithm using mult...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Digital Contents Society

سال: 2013

ISSN: 1598-2009

DOI: 10.9728/dcs.2013.14.1.117